package leetcode.weekly.week327;

import leetcode.helper.H;

public class Solution4Test extends H {

	public void debug4(Solution4 so) {
		H.compare(133, so.findCrossingTime(8, 5, H.str2array1("[[10,8,4,7],[10,6,9,10],[3,7,4,6],[7,3,9,10],[10,6,3,5]]")));
		H.compare(50, so.findCrossingTime(3, 2, H.str2array1("[[1,9,1,8],[10,10,10,10]]")));
		H.compare(6, so.findCrossingTime(1, 3, H.str2array1("[[1,1,2,1],[1,1,3,1],[1,1,4,1]]")));
	}

	public void debug3(Solution4 so) {
//		H.compare(so, so);
	}

	public void debug2(Solution4 so) {
//		H.compare(so, so);
	}

	public void debug1(Solution4 so) {
//		H.compare(so, so);
	}

	public static void main(String[] args) {
		Solution4Test test = new Solution4Test();
		Solution4 so = new Solution4();
		test.debug1(so);
		test.debug2(so);
		test.debug3(so);
		test.debug4(so);
	}

}
